翻訳と辞書 |
Karp–Flatt metric : ウィキペディア英語版 | Karp–Flatt metric The Karp–Flatt metric is a measure of parallelization of code in parallel processor systems. This metric exists in addition to Amdahl's law and Gustafson's law as an indication of the extent to which a particular computer code is parallelized. It was proposed by Alan H. Karp and Horace P. Flatt in 1990. ==Description== Given a parallel computation exhibiting speedup on processors, where > 1, the experimentally determined serial fraction is defined to be the Karp–Flatt Metric viz: : The less the value of the better the parallelization.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Karp–Flatt metric」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|